Counting of Moore Families for n=7

نویسندگان

  • Pierre Colomb
  • Alexis Irlande
  • Olivier Raynaud
چکیده

Given a set Un = {0, 1, ..., n−1}, a collectionM of subsets of Un that is closed under intersection and contains Un is known as a Moore family. The set of Moore families for a given n, denoted by Mn, increases very quickly with n, thus |M3| is 61 and |M4| is 2480. In [1] the authors determined the number for n = 6 and stated a 24hcomputation-time. Thus, the number for n = 7 can be considered as an extremely di cult technical challenge. In this paper, we introduce a counting strategy for determining the number of Moore families for n = 7 and we give the exact value : 14 087 648 235 707 352 472. Our calculation is particularly based on the enumeration of Moore families up to an isomorphism for n ranging from 1 to 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE CAPACITY OF EILENBERG-MACLANE AND MOORE SPACES

K. Borsuk in 1979, at the Topological Conference in Moscow, introduced concept of the capacity of a compactum and asked some questions concerning properties of the capacity ofcompacta. In this paper, we give partial positive answers to three of these questions in some cases. In fact, by describing spaces homotopy dominated by Moore and Eilenberg-MacLane spaces, the capacities of a Moore space $...

متن کامل

About the Recursive Decomposition of the lattice of co-Moore Families

Given a set Un = {0, 1, ..., n− 1}, a collection M of subsets of Un that is closed under intersection and contains Un is known as a Moore family. The set of Moore families for a xed n is in bijection with the set of Moore co-families (union-closed families containing the empty set) denoted itself Mn. In this paper, we propose for the rst time a recursive de nition of the set of Moore co-familie...

متن کامل

A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-families

Given a set Un = {1, ..., n}, a collectionM of subsets of Un that is closed under intersection and contains Un is known as a Moore family. The set of Moore families for a fixed n is in bijection with the set of Moore co-families (union-closed families containing the empty set) denoted itself Mn. This paper follows the work initiated in [8] and [9] about the recursive decomposition of the lattic...

متن کامل

Hermitian solutions to the system of operator equations T_iX=U_i.

In this article we consider the system of operator equations T_iX=U_i for i=1,2,...,n and give necessary and suffcient conditions for the existence of common Hermitian solutions to this system of operator equations for arbitrary operators without the closedness condition. Also we study the Moore-penrose inverse of a ncross 1 block operator matrix and. then gi...

متن کامل

Accuracy Evaluation of The Depth of Six Kinds of Sperm Counting Chambers for both Manual and Computer-Aided Semen Analyses

Background Although the depth of the counting chamber is an important factor influencing sperm counting, no research has yet been reported on the measurement and comparison of the depth of the chamber. We measured the exact depths of six kinds of sperm counting chambers and evaluated their accuracy. MaterialsAndMethods In this prospective study, the depths of six kinds of sperm counting chamber...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010